The Complexity of Systolic Dissemination of Information in Interconnection Networks

A concept of systolic dissemination of information in interconnection networks is presented, and the complexity of systolic gossip and broadcast in one-way (telegraph) and two-way (telephone) communication mode is investigated. The following main results are established: (i) a general relation between systolic broadcast and systolic gossip, (ii) optimal systolic gossip algorithms on paths in both communication modes, and (iii) optimal systolic gossip algorithms for complete k-ary trees in both communication modes.